Optimizing costs of age replacement policies

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Note on History of Age Replacement Policies

This paper tries to trace our research history briefly from Barlow and Proschan to attain general replacement models. We begin with a random age replacement policy that is planned at a random time Y and call it as random replacement. When the distribution of Y becomes a degenerate distribution placing unit mass at T, age replacement is formulated. We obtain the general formulas for optimum repl...

متن کامل

Optimizing Instructional Policies

Psychologists are interested in developing instructional policies that boost student learning. An instructional policy specifies the manner and content of instruction. For example, in the domain of concept learning, a policy might specify the nature of exemplars chosen over a training sequence. Traditional psychological studies compare several hand-selected policies, e.g., contrasting a policy ...

متن کامل

Optimizing Metabonomic Spectral Replacement

Metabonomics [1, 2], the measure of the fingerprint of biochemical perturbations caused by disease, drugs or toxins, recently has become a major focus of research in various areas [3] especially indications of drug toxicity [4-8]. Two types of technology (known by the initials NMR and MS) are employed and both produce massive data in form of spectra. Sophisticated statistical models, known as p...

متن کامل

AGE REPLACEMENT POLICY IN UNCERTAIN ENVIRONMENT

Age replacement policy is concerned with finding an optional time tominimize the cost, at which time the unit is replaced even if itdoes not fail. So far, age replacement policy involving random agehas been proposed. This paper will assume the age of the unit is anuncertain variable, and find the optimal time to replace the unit.

متن کامل

Predictability of Cache Replacement Policies

Hard real-time systems must obey strict timing constraints. Therefore, one needs to derive guarantees on the worst-case execution times of the systems’ tasks. In this context, predictable behavior of system components is crucial for the derivation of tight and thus useful

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Stochastic Processes and their Applications

سال: 1986

ISSN: 0304-4149

DOI: 10.1016/0304-4149(86)90096-7